Recent Advances in Multi-Dimensional Packing Problems
نویسندگان
چکیده
Packing problems have been much studied in the past decades due, in particular, to their wide range of applications in many settings of theoretical and practical interest, including packing/loading, scheduling, and routing. We focus onMulti-Dimensional Packing problems, which present specific methodological challenges while also being of particular interest to transportation and modern supply chains, due to the need to consolidate and optimize flows of freight and vehicles. The rich literature presents a plethora of problem variants, models, and solution methods. Yet, a general overview and synthesis of the field is missing, as we lack a general methodological framework able to efficiently address different problem variants, i.e., obtain good-quality solutions with limited computational efforts. Addressing these issues is the main goal of this chapter.
منابع مشابه
Recent advances on two-dimensional bin packing problems
We survey recent advances obtained for the two-dimensional bin packing problem, with special emphasis on exact algorithms and e1ective heuristic and metaheuristic approaches. ? 2002 Elsevier Science B.V. All rights reserved.
متن کاملAn Interval Graph-based Tabu Search Framework for Multi-dimensional Packing
Packing is a vast and continuously growing field in the area of Operations Research and Combinatorial Optimization. Roughly speaking, given a set of items and a set of containers, packing problems are concerned with the loading of the items into the containers, according to some packing rules and optimizing a performance measure. Under this broad definition, we find a wide set of real-life and ...
متن کاملMulti-Dimensional Packing by Tabu Search
The paper deals with multi-dimensional cutting and packing and metaheuristic algorithms. A brief overview of this area is presented, and the general Tabu Search framework of Lodi, Martello and Vigo [LMV99a] is considered in detail. Computational results on multi-dimensional bin packing problems are reported, and possible methods for extending the framework to other packing problems are finally ...
متن کاملAbstract: Packing rectangular shapes into a rectangular space is one of the most important discussions on Cutting & Packing problems (C;P) such as: cutting problem, bin-packing problem and distributor's pallet loading problem, etc. Assume a set of rectangular pieces with specific lengths, widths and utility values. Also assume a rectangular packing space with specific width and length. The obj...
متن کاملA Greedy Adaptive Search Procedure for Multi-Dimensional Multi-Container Packing Problems
Multi-dimensional multi-container packing problems appear within many settings of theoretical and practical interest, including Knapsack, Strip Packing, Container Loading, and Scheduling problems. These various problem settings display different objective functions and constraints, which may explain the lack of efficient heuristics able to jointly address them. In this paper we introduce GASP G...
متن کامل